Rule-Generating Abduction for Recursive Prolog
نویسنده
چکیده
The rule-generating abduction is a kind of abduction which generates a rule and proposes a hypothesis from a surprising fact . In general, there may exist in nitely many rules and hypotheses to explain such a surprising fact. Hence, we need to put some restriction on the class of rules. In rule-generating abduction, only one surprising fact is given. Hence, we also need to generalize the concept of a surprising fact. When we deal with such generalizations, we must avoid overgeneralization. It should be determined whether or not a generalization is overgeneral by an intended model. However, it is hard to give in advance such an intended model in our rule-generating abduction. Hence, in this paper we introduce a syntactical formulation of generalization, in which it can be determined whether or not a generalization is overgeneral by the forms of atoms and substitutions. On the other hand, by the restriction of rules, it su ces to consider only two types of terms, constants and lists, and two types of substitutions with these two terms. By using the above generalizations and substitutions, we design an algorithm for rule-generating abduction, which generates rules and proposes hypotheses in polynomial time with respect to the length of a surprising fact. The number of rules and hypotheses is at most the number of common terms in a surprising fact. Furthermore, we show that a common term in some argument of a surprising fact also appears in the same argument of the proposed hypothesis by this algorithm.
منابع مشابه
Experiences and directions for Abduction and Induction using Constraint Handling Rules∗ POSITION PAPER
Techniques for doing abduction in a combination of Prolog and Constraint Handling Rules (CHR) are reviewed, and the possible extension to combine with induction is considered. While the indicated implementation for abduction is very efficient, the ideas for induction are at a much more experimental stage. However, experimentation within CHR indicates a logical semantics for the induction mechan...
متن کاملA Note on Rule-Finding Abduction
The rulending abduction is an abduction which begins with the observation of a surprising fact, nds a rule in the set of programs, and proposes a hypothesis. This paper investigates such rulending abduction for logic programming from two viewpoints: termination and analogical reasoning. In order to discuss the termination of rulending abduction, we introduce two concepts of loop-pair and loop-e...
متن کاملAssumptions and Abduction in Prolog
Abduction is agreed upon as a powerful technique in logic programming but its actual use in practice appears to be rather limited since most available systems are research prototypes implemented using inefficient metaprogramming techniques. Assumptive logic programming is related to abduction but provides explicit creation and consumption of hypotheses plus scoping principles inspired by linear...
متن کاملTabdual: a Tabled Abduction System for Logic Programs
Abduction has been on the back burner in logic programming, as abduction can be too difficult to implement, and costly to perform, in particular if abductive solutions are not tabled. On the other hand, current Prolog systems, with their tabling mechanisms, are mature enough to facilitate the introduction of tabling abductive solutions (tabled abduction) into them. Our contributions are as foll...
متن کاملA classification of abduction: abduction for logic programming
Abduction is a methodology of scienti c researches. Peirce showed three types of abduction, and expressed them by one syllogism. Recently various researches on abduction or abductive logic have been developed in the elds of automated reasoning and machine learning. In order to systematically understand such researches and to clearly discuss abduction, this paper classi es abduction into ve type...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994